Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(a, f2(b, x)) -> f2(b, f2(a, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(c, f2(a, x)) -> f2(a, f2(c, x))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(a, f2(b, x)) -> f2(b, f2(a, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(c, f2(a, x)) -> f2(a, f2(c, x))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F2(b, f2(c, x)) -> F2(b, x)
F2(c, f2(a, x)) -> F2(a, f2(c, x))
F2(a, f2(b, x)) -> F2(a, x)
F2(b, f2(c, x)) -> F2(c, f2(b, x))
F2(a, f2(b, x)) -> F2(b, f2(a, x))
F2(c, f2(a, x)) -> F2(c, x)

The TRS R consists of the following rules:

f2(a, f2(b, x)) -> f2(b, f2(a, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(c, f2(a, x)) -> f2(a, f2(c, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F2(b, f2(c, x)) -> F2(b, x)
F2(c, f2(a, x)) -> F2(a, f2(c, x))
F2(a, f2(b, x)) -> F2(a, x)
F2(b, f2(c, x)) -> F2(c, f2(b, x))
F2(a, f2(b, x)) -> F2(b, f2(a, x))
F2(c, f2(a, x)) -> F2(c, x)

The TRS R consists of the following rules:

f2(a, f2(b, x)) -> f2(b, f2(a, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(c, f2(a, x)) -> f2(a, f2(c, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


F2(b, f2(c, x)) -> F2(b, x)
F2(a, f2(b, x)) -> F2(a, x)
F2(c, f2(a, x)) -> F2(c, x)
The remaining pairs can at least by weakly be oriented.

F2(c, f2(a, x)) -> F2(a, f2(c, x))
F2(b, f2(c, x)) -> F2(c, f2(b, x))
F2(a, f2(b, x)) -> F2(b, f2(a, x))
Used ordering: Combined order from the following AFS and order.
F2(x1, x2)  =  x2
b  =  b
f2(x1, x2)  =  f2(x1, x2)
c  =  c
a  =  a

Lexicographic Path Order [19].
Precedence:
[b, c, a] > f2


The following usable rules [14] were oriented:

f2(c, f2(a, x)) -> f2(a, f2(c, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(a, f2(b, x)) -> f2(b, f2(a, x))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F2(c, f2(a, x)) -> F2(a, f2(c, x))
F2(a, f2(b, x)) -> F2(b, f2(a, x))
F2(b, f2(c, x)) -> F2(c, f2(b, x))

The TRS R consists of the following rules:

f2(a, f2(b, x)) -> f2(b, f2(a, x))
f2(b, f2(c, x)) -> f2(c, f2(b, x))
f2(c, f2(a, x)) -> f2(a, f2(c, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.